Wielandt type theorem for Cartesian product of digraphs
نویسندگان
چکیده
منابع مشابه
Reliability of interconnection networks modeled by Cartesian product digraphs
We determine that the connectivity and the edgeconnectivity of the Cartesian product G1 × G2 of two strongly connected and finite digraphs G1 and G2 are equal to min{n1κ2,n2κ1, δ+ 1 + δ+ 2 , δ− 1 + δ− 2 } and min{n1λ2,n2λ1, δ+ 1 + δ+ 2 , δ− 1 + δ− 2 }, respectively, where ni , κi , λi , δ + i , δ − i are the order, the connectivity, the edgeconnectivity, the minimum out-degree and the minimum i...
متن کاملWide Diameters of Cartesian Product Graphs and Digraphs
In graph theory and study of fault tolerance and transmission delay of networks, connectivity and diameter of a graph are two very important parameters and have been deeply studied by many authors. Wide diameter combining connectivity with diameter is a more important parameter to measure fault tolerance and efficiency of parallel processing computer networks and has received much attention in ...
متن کاملHighly Fault-Tolerant Routings in Some Cartesian Product Digraphs
Consider a communication network G in which a limited number of edge(arc) and/or vertex faults F might occur. A routing ρ, i.e. a fixed path between each pair of vertices, for the network must be chosen without knowing which components might become faulty. The diameter of the surviving route graph R(G, ρ)/F , where R(G, ρ)/F is a digraph with the same vertices as G − F and a vertex x being adja...
متن کاملKernels in Cartesian products of digraphs
A kernel J of a digraph D is an independent set of vertices of D such that for every vertex w ∈ V (D)\J there exists an arc from w to a vertex in J . In this paper we have obtained results for the existence and nonexistence of kernels in Cartesian products of certain families of digraphs, and characterized T Cn, T Pn and Cm Cn which have kernels, where T is a tournament, and Pn and Cn are, resp...
متن کاملAn isomorphism theorem for digraphs
A seminal result by Lovász states that two digraphs A and B (possibly with loops) are isomorphic if and only if for every digraph X the number of homomorphisms X → A equals the number of homomorphisms X → B. Lovász used this result to deduce certain cancellation properties for the direct product of digraphs. We develop an analogous result for the class of digraphs without loops, and with weak h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2008
ISSN: 0024-3795
DOI: 10.1016/j.laa.2008.04.029